True Concurrency = Interleaving Concurrency + Weak Conflict

نویسندگان

  • Leila Ribeiro
  • Martin Korff
چکیده

In this paper we show that true concurrency is not the same as interleaving concur rency for systems that allow read access More precisely whenever two actions are interleavingly concurrent they are also truly concurrent but the converse is not al ways true due to a phenomena that we call weak con ict that allows the possibility of one writer to act in parallel with one or many readers

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Locality and True-concurrency in Calculi for Mobile Processes

Process algebra semantics can be categorised into true-concurrency semantics, where parallel composition is considered a primitive operator, and interleaving semantics, where concurrency is reduced to sequentiality plus non-determinism. The former have an appealing intuitive justiication, but the latter are mathematically more tractable. This paper addresses the study of true-concurrency semant...

متن کامل

Optimization of majority protocol for controlling transactions concurrency in distributed databases by multi-agent systems

In this paper, we propose a new concurrency control algorithm based on multi-agent systems which is an extension of majority protocol. Then, we suggest a clustering approach to get better results in reliability, decreasing message passing and algorithm’s runtime. Here, we consider n different transactions working on non-conflict data items. Considering execution efficiency of some different...

متن کامل

A True Concurrency Semantics for ET-LOTOS

One of the central objectives of the LOTOS re-standardisation activity is to deene an enhanced LOTOS language which supports real-time speciica-tion. The timed extension is based upon a timed LOTOS proposal ET-LOTOS. This paper deenes a (branching-time) non-interleaving semantics for ET-LOTOS without data. As a denotational model a suitable timed extension of Langerak's bundle event structures ...

متن کامل

Finitary logics for some ees observational bisimulations

The conditions involve information on the amount of top-level parallelism of states. This result may add fuel to the interleaving-versus-true-concurrency debate, since it suggests that the ability to observe internal structure of states (which is what distinguishes noninterleaving semantics from interleaving semantics) can lead not only to semantics which are more expressive, but also to semant...

متن کامل

Concurrency Can't Be Observed, Asynchronously

The paper is devoted to an analysis of the concurrent features of asynchronous systems. A preliminary step is represented by the introduction of a non-interleaving extension of barbed equivalence. This notion is then exploited in order to prove that concurrency cannot be observed through asynchronous interactions, i.e., that the interleaving and concurrent versions of a suitable asynchronous we...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • Electr. Notes Theor. Comput. Sci.

دوره 14  شماره 

صفحات  -

تاریخ انتشار 1998